﻿#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution1 {
public:
    string longestPalindrome(string s) {
        int n = s.size();

        vector<vector<bool>> dp(n, vector<bool>(n));

        int len = 1, begin = 0;
        for (int i = n - 1; i >= 0; --i)
        {
            for (int j = i; j < n; ++j)
            {
                if (s[i] == s[j])
                    dp[i][j] = i + 1 < j ? dp[i + 1][j - 1] : true;
                if (dp[i][j] && j - i + 1 > len) // 找出⼦串中最⻓的回⽂⼦串
                    len = j - i + 1, begin = i;
            }
        }
        return s.substr(begin, len);
    }
};

class Solution {
public:
    bool checkPartitioning(string s) {
        int n = s.size();

        vector<vector<bool>> dp(n, vector<bool>(n));

        //判断整个字符串中的所有子串是否为回文串
        for (int i = n - 1; i >= 0; --i)
            for (int j = i; j < n; ++j)
                if (s[i] == s[j])
                    dp[i][j] = i + 1 < j ? dp[i + 1][j - 1] : true;

        for (int i = 1; i < n - 1; i++)
            for (int j = i; j < n - 1; j++)
                if (dp[0][i - 1] && dp[i][j] && dp[j + 1][n - 1])
                    return true;
        return false;
    }
};

int main()
{
	return 0;
}